منابع مشابه
Faster Lossy Generalized Flow via Interior Point Algorithms ∗
We present asymptotically faster approximation algorithms for the generalized flow problems in which multipliers on edges are at most 1. For this lossy version of the maximum generalized flow problem, we obtain an additive ǫ approximation of the maximum flow in time Õ ( m log(U/ǫ) ) , where m is the number of edges in the graph, all capacities are integers in the range {1, . . . , U}, and all l...
متن کاملDistributed Agent-based Dynamic State Estimation over a Lossy Network
In this paper, a novel distributed agent-based dynamical system estimation strategy is proposed. Each agent has a local observation space and is interested in a specific set of system state elements. The agents have the ability of two-way communication with its neighbors (i.e., agents who share at least one state element). At a particular time instant, each agent predicts its state and makes in...
متن کاملShort-term Flow Management Based on Dynamic Flow Programming Network
Zhaoning ZHANG Professor Research Base of Air Traffic Management Civil Aviation University of China 100 Xunhai Road, .Dongli District, Tianjin 300300 China Fax: +86-22-2409-2454 E-mail: [email protected] Lili WANG Research Associate Air traffic Management College Civil Aviation University of China 100 Xunhai Road, .Dongli District, Tianjin 300300 China Fax: +86-22-2409-2454 E-mail: wll_nwpu@sin...
متن کاملUncertain Dynamic Network Flow Problems
In this paper, uncertain dynamic network flow problems (UDNFPs) are formulated, and an algorithm is proposed to solve them by noting that arc capacities are uncertain (may vary with time or not), and flow varies over time in each arc. Here, uncertainty refers to nondeterministic states, in which some factors are uncertain and cannot be determined by the probability theory. Since the uncertainty...
متن کاملGeneralized Preconditioning and Network Flow Problems
We consider approximation algorithms for the problem of finding x of minimal norm ‖x‖ satisfying a linear system Ax = b, where the norm ‖ · ‖ is arbitrary and generally non-Euclidean. We show a simple general technique for composing solvers, converting iterative solvers with residual error ‖Ax−b‖ ≤ t−Ω(1) into solvers with residual error exp(−Ω(t)), at the cost of an increase in ‖x‖, by recursi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Institute of Engineering
سال: 2019
ISSN: 1810-3383
DOI: 10.3126/jie.v15i2.27664